Robust SOS-convex polynomial optimization problems: exact SDP relaxations
نویسندگان
چکیده
منابع مشابه
Robust SOS-Convex Polynomial Programs: Exact SDP Relaxations
This paper studies robust solutions and semidefinite linear programming (SDP) relaxations of a class of convex polynomial optimization problems in the face of data uncertainty. The class of convex optimization problems, called robust SOS-convex polynomial optimization problems, includes robust quadratically constrained convex optimization problems and robust separable convex polynomial optimiza...
متن کاملA note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
This short note extends the sparse SOS (sum of squares) and SDP (semidefinite programming) relaxation proposed by Waki, Kim, Kojima and Muramatsu for normal POPs (polynomial optimization problems) to POPs over symmetric cones, and establishes its theoretical convergence based on the recent convergence result by Lasserre on the sparse SOS and SDP relaxation for normal POPs. A numerical example i...
متن کاملExact SDP Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
For binary polynomial optimization problems (POPs) of degree d with n variables, we prove that the ⌈(n+ d− 1)/2⌉th semidefinite (SDP) relaxation in Lasserre’s hierarchy of the SDP relaxations provides the exact optimal value. If binary POPs involve only even-degree monomials, we show that it can be further reduced to ⌈(n + d − 2)/2⌉. This bound on the relaxation order coincides with the conject...
متن کاملSdp Relaxations for Quadratic Optimization Problems Derived from Polynomial Optimization Problems
Based on the convergent sequence of SDP relaxations for a multivariate polynomial optimization problem (POP) by Lasserre, Waki et al. constructed a sequence of sparse SDP relaxations to solve sparse POPs efficiently. Nevertheless, the size of the sparse SDP relaxation is the major obstacle in order to solve POPs of higher degree. This paper proposes an approach to transform general POPs to quad...
متن کاملConvergent SDP-Relaxations for Polynomial Optimization with Sparsity
We consider a polynomial programming problem P on a compact semi-algebraic set K ⊂ Rn, described by m polynomial inequalities gj(X) ≥ 0, and with criterion f ∈ R[X]. We propose a hierarchy of semidefinite relaxations in the spirit those of Waki et al. [9]. In particular, the SDP-relaxation of order r has the following two features: (a) The number of variables is O(κ2r) where κ = max[κ1, κ2] wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2014
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-014-0732-z